Estimates for the Rapid Decay of Concentration Functions of n-Fold Convolutions

We estimate the concentration functions of n-fold convolutions of one-dimensional probability measures. The Kolmogorov–Rogozin inequality implies that for nondegenerate distributions these functions decrease at least as O(n ^–1/2). On the other hand, Esseen⁽³⁾ has shown that this rate is o(n ^–1/2) iff the distribution has an infinite second moment. This statement was sharpened by Morozova.⁽⁹⁾ Theorem 1 of this paper provides an improvement of Morozova's result. Moreover, we present more general estimates which imply the rates o(n ^–1/2).     

转动系统的相对论性分析力学理论

本文讨论了转动相对论力学理论，主要是建立转动系统的相对论性分析力学理论·构造转动系统的相对论性广义动能函数Ｔｒ＝∑ｎｉ＝１Ｉ０ｉΓｉ２（１－１－θ·２ｉ／Γｉ２）和广义加速度能量函数Ｓｒ＝１２∑ｎｉ＝１Ｉｉ（θ·ｉ·θ¨ｉ）２Γｉ２－θ·２ｉ＋θ¨２ｉ，给出其Ｈａｍｉｌｔｏｎ原理和三种不同形式的Ｄ′Ａｌｅｍｂｅｒｔ原理；对于完整约束系统，建立了转动系统的相对论性Ｌａｇｒａｎｇｅ方程、Ｎｉｅｌｓｅｎ方程、Ａｐｐｅｌ方程和Ｈａｍｉｌｔｏｎ正则方程；对于非完整约束系统，建立了转动系统的相对论性Ｒｏｕｔｈ方程、Чаплыгин方程、Ｎｉｅｌｓｅｎ方程和Ａｐｐｅｌ方程；并给出转动系统的相对论性Ｎｏｅｔｈｅｒ守恒律     

Variable resolution triangulations

A comprehensive study of multiresolution decompositions of planar domains into triangles is given. A general model is introduced, called a Multi-Triangulation (MT), which is based on a collection of fragments of triangulations arranged into a directed acyclic graph. Different decompositions of a domain can be obtained by combining different fragments of the model. Theoretical results on the expressive power of the MT are given. An efficient algorithm is proposed that can extract a triangulation from the MT, whose level of detail is variable over the domain according to a given threshold function. The algorithm works in linear time, and the extracted representation has minimum size among all possible triangulations that can be built from triangles in the MT, and that satisfy the given level of detail. Major applications of these results are in real-time rendering of complex surfaces, such as topographic surfaces in flight simulation.     

图的度序列不等式

用代数的方法证明了有关图度序列的几个不等式，并且得到了其相应的极图。     

Bellman最优性原理——论动态规划(Ⅰ)

对于Bellman最优性原理,本文举出实例表明:(1)策略不一定有(合理的)子策略;(2)子策略不一定存在最优子策略;(3)最优策略不一定有最优子策略;(4)用最短路与反证法来论述最优性原理的正确性,不能肯定成立;(5)Bellman最优性原理与其递推公式并不等价。 讨论四类最优策略之后,给出最优性原理与递推公式等价的一个充分性定理。     

WEAK CONVERGENCE OF HENSTOCK INTEGRABLE SEQUENCES

Some relationships between pointwise and weak convergence of a sequence of Henstock integrable functions are studied, In particular it is provided an example of a sequence of Henstock integrable functions whose pointwise limit is different from the weak one. By introducing an asymptotic version of the Henstock equiintegrability notion it is given a necessary and sufficient condition in order that a pointwisely convergent sequence of Henstock integrable functions is weakly convergent to its pointwise limit.     

Convergence analysis of time-point relaxation iterates for linear systems of differential equations

We study convergence properties of time-point relaxation (TR) Runge-Kutta methods for linear systems of ordinary differential equations. TR methods are implemented by decoupling systems in Gauss-Jacobi, Gauss-Seidel and successive overrelaxation modes (continuous-time iterations) and then solving the resulting subsystems by means of continuous extensions of Runge-Kutta (CRK) methods (discretized iterations). By iterating to convergence, these methods tend to the same limit called diagonally split Runge-Kutta (DSRK) method. We prove that TR methods are equivalent to decouple in the same modes the linear algebraic system obtained by applying DSRK limit method. This issue allows us to study the convergence of TR methods by using standard principles of convergence of iterative methods for linear algebraic systems. For a particular problem regions of convergence are plotted.     

集合环

本文用集环来表现模糊集，得到了表现定理的新形式，并证明了这种表现可以有限化，即用有限个经典集近似刻划模糊集并且这样的刻划是同态的。最后，证明了集对方法是集环表现的特殊情形。     

Complete Surjections and Complete Epimorphisms over Completely Distributive Lattices

Generators and lattice properties of the poset of complete homomorphisic images of a completely distributive lattice are exploited via the localic methods. Some intrinsic and extrinsic conditions about this poset to be a completely distributive lattice are given. It is shown that the category of completely distributive lattices is co-well-powered,and complete epimorphisms on completely distributive lattice are not necessary to be surjections. Finally, some conditions about complete epimorphisms to be surjections are given.